- LeetCode 380

Map + list

1	4	3	

- LeetCode 33
Plan:
1) Find pivot idx
2) Restrict the scope of the search based on the pivot idx

Time complexity: O(log2(n))

- LeetCode 1352:
Prefix sum:

1	2	3	5

Prefix sum array:
1	3	6	11

Prefix product array:
1	2	6	30